- fixpoint semantics
- Программирование: семантика неподвижной точки (логическое программирование)
Универсальный англо-русский словарь. Академик.ру. 2011.
fixpoint semantics
Смотреть что такое "fixpoint semantics" в других словарях:
Robert Kowalski — Infobox Scientist image width = 150px name = Robert Anthony Kowalski birth date = Birth date and age|1941|5|15|mf=y birth place = Bridgeport, Connecticut death date = death place = residence = citizenship = Naturalised British Citizen nationality … Wikipedia
Knaster–Tarski theorem — In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following:: Let L be a complete lattice and let f : L → L be an order preserving function. Then the set … Wikipedia
Complete partial order — In mathematics, directed complete partial orders and ω complete partial orders (abbreviated to dcpo, ωcpo or sometimes just cpo) are special classes of partially ordered sets, characterized by particular completeness properties. Complete partial… … Wikipedia
Data-flow analysis — is a technique for gathering information about the possible set of values calculated at various points in a computer program. A program s control flow graph (CFG) is used to determine those parts of a program to which a particular value assigned… … Wikipedia
Modal μ-calculus — In theoretical computer science, the modal μ calculus (also μ calculus, but this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint… … Wikipedia
Bisimulation — In theoretical computer science a bisimulation is a binary relation between state transition systems, associating systems which behave in the same way in the sense that one system simulates the other and vice versa.Intuitively two systems are… … Wikipedia
Fixed point theorem — In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F ( x ) = x ), under some conditions on F that can be stated in general terms. Results of this kind are amongst the … Wikipedia
Stratification (mathematics) — Stratification has several usages in mathematics. In mathematical logic In mathematical logic, stratification is any consistent assignment of numbers to predicate symbols guaranteeing that a unique formal interpretationof a logical theory exists … Wikipedia
Least fixed point — In order theory, a branch of mathematics, the least fixed point (lfp or LFP) of a function is the fixed point which is less than or equal to all other fixed points, according to some partial order. For example, the least fixed point of the real… … Wikipedia
List of important publications in computer science — This is a list of important publications in computer science, organized by field. Some reasons why a particular publication might be regarded as important: Topic creator – A publication that created a new topic Breakthrough – A publication that… … Wikipedia
Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y) (cl… … Wikipedia
